منابع مشابه
An Accelerated Subspace Iteration Method
The analysis of a number of physical phenomena requires the solution of an eigenproblem. It is therefore natural that with the increased use of computational methods operating on discrete representations of physical problems the development of efficient algorithms for the calculation of eigenvalues and eigenvectors has attracted much attention [l]-[8]. In particular, the use of finite element a...
متن کامل26.1 Metropolis Method 26.1.1 Mcmc Review 26.1.2 Metropolis Filter
But how do we actually construct a Markov chain with a stationary distribution equal to our target distribution? Also, we want this method to have a good (that is, small) mixing time. The Metropolis method allows us achieve these goals by defining our Markov chain as a random walk over a suitably defined graph. We define the approach as follows. Say we which to sample values i ∈ Ω from a distri...
متن کاملThe Short-Cut Metropolis Method
I show how one can modify the random-walk Metropolis MCMC method in such a way that a sequence of modified Metropolis updates takes little computation time when the rejection rate is outside a desired interval. This allows one to effectively adapt the scale of the Metropolis proposal distribution, by performing several such “short-cut” Metropolis sequences with varying proposal stepsizes. Unlik...
متن کاملAn Accelerated Method for Nonlinear Elliptic PDE
We propose two numerical methods for accelerating the convergence of the standard fixed point method associated with a nonlinear and/or degenerate elliptic partial differential equation. The first method is linearly stable, while the second is provably convergent in the viscosity solution sense. In practice, the methods converge at a nearly linear complexity in terms of the number of iterations...
متن کاملAn Accelerated Proximal Coordinate Gradient Method
We develop an accelerated randomized proximal coordinate gradient (APCG) method, for solving a broad class of composite convex optimization problems. In particular, our method achieves faster linear convergence rates for minimizing strongly convex functions than existing randomized proximal coordinate gradient methods. We show how to apply the APCG method to solve the dual of the regularized em...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 1998
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.476862